0.10/0.10	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.10/0.10	% Command    : run_E %s %d THM
0.10/0.31	% Computer : n012.cluster.edu
0.10/0.31	% Model    : x86_64 x86_64
0.10/0.31	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.10/0.31	% Memory   : 8042.1875MB
0.10/0.31	% OS       : Linux 3.10.0-693.el7.x86_64
0.10/0.31	% CPULimit   : 1440
0.10/0.31	% WCLimit    : 180
0.10/0.31	% DateTime   : Thu Jul  4 08:33:09 EDT 2024
0.10/0.31	% CPUTime    : 
0.17/0.44	Running higher-order theorem proving
0.17/0.44	Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox2/tmp/tmp.3ucgMh4tEK/E---3.1_20617.p
0.17/0.46	# Version: 3.2.0-ho
0.17/0.46	# Preprocessing class: HSSSSLSSSLMNSFA.
0.17/0.46	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.17/0.46	# Starting new_ho_10 with 900s (5) cores
0.17/0.46	# Starting full_lambda_3 with 180s (1) cores
0.17/0.46	# Starting ho_unfolding_6 with 180s (1) cores
0.17/0.46	# Starting sh4l with 180s (1) cores
0.17/0.46	# sh4l with pid 20698 completed with status 0
0.17/0.46	# Result found by sh4l
0.17/0.46	# Preprocessing class: HSSSSLSSSLMNSFA.
0.17/0.46	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.17/0.46	# Starting new_ho_10 with 900s (5) cores
0.17/0.46	# Starting full_lambda_3 with 180s (1) cores
0.17/0.46	# Starting ho_unfolding_6 with 180s (1) cores
0.17/0.46	# Starting sh4l with 180s (1) cores
0.17/0.46	# No SInE strategy applied
0.17/0.46	# Search class: HHUSF-FFSS21-DSFFMSBN
0.17/0.46	# partial match(3): HHUSF-FFSF22-SSFFMSBN
0.17/0.46	# Scheduled 5 strats onto 1 cores with 180 seconds (180 total)
0.17/0.46	# Starting new_ho_10 with 109s (1) cores
0.17/0.46	# new_ho_10 with pid 20701 completed with status 0
0.17/0.46	# Result found by new_ho_10
0.17/0.46	# Preprocessing class: HSSSSLSSSLMNSFA.
0.17/0.46	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.17/0.46	# Starting new_ho_10 with 900s (5) cores
0.17/0.46	# Starting full_lambda_3 with 180s (1) cores
0.17/0.46	# Starting ho_unfolding_6 with 180s (1) cores
0.17/0.46	# Starting sh4l with 180s (1) cores
0.17/0.46	# No SInE strategy applied
0.17/0.46	# Search class: HHUSF-FFSS21-DSFFMSBN
0.17/0.46	# partial match(3): HHUSF-FFSF22-SSFFMSBN
0.17/0.46	# Scheduled 5 strats onto 1 cores with 180 seconds (180 total)
0.17/0.46	# Starting new_ho_10 with 109s (1) cores
0.17/0.46	# Preprocessing time       : 0.001 s
0.17/0.46	# Presaturation interreduction done
0.17/0.46	
0.17/0.46	# Proof found!
0.17/0.46	# SZS status Theorem
0.17/0.46	# SZS output start CNFRefutation
0.17/0.46	thf(decl_22, type, in: $i > $i > $o).
0.17/0.46	thf(decl_25, type, powerset: $i > $i).
0.17/0.46	thf(decl_26, type, dsetconstr: $i > ($i > $o) > $i).
0.17/0.46	thf(decl_27, type, dsetconstrI: $o).
0.17/0.46	thf(decl_28, type, binunion: $i > $i > $i).
0.17/0.46	thf(decl_29, type, kpair: $i > $i > $i).
0.17/0.46	thf(decl_30, type, cartprod: $i > $i > $i).
0.17/0.46	thf(decl_31, type, ubforcartprodlem3: $o).
0.17/0.46	thf(decl_32, type, esk1_0: $i).
0.17/0.46	thf(decl_33, type, esk2_0: $i).
0.17/0.46	thf(decl_34, type, esk3_0: $i).
0.17/0.46	thf(decl_35, type, esk4_0: $i).
0.17/0.46	thf(dsetconstrI, axiom, ((dsetconstrI)<=>![X1:$i, X2:$i > $o, X3:$i]:(((in @ X3 @ X1)=>((X2 @ X3)=>(in @ X3 @ (dsetconstr @ X1 @ (^[X4:$i]:((X2 @ X4))))))))), file('/export/starexec/sandbox2/tmp/tmp.3ucgMh4tEK/E---3.1_20617.p', dsetconstrI)).
0.17/0.46	thf(cartprodpairin, conjecture, ((dsetconstrI)=>((ubforcartprodlem3)=>![X1:$i, X5:$i, X3:$i]:(((in @ X3 @ X1)=>![X4:$i]:(((in @ X4 @ X5)=>(in @ (kpair @ X3 @ X4) @ (cartprod @ X1 @ X5)))))))), file('/export/starexec/sandbox2/tmp/tmp.3ucgMh4tEK/E---3.1_20617.p', cartprodpairin)).
0.17/0.46	thf(ubforcartprodlem3, axiom, ((ubforcartprodlem3)<=>![X1:$i, X5:$i, X3:$i]:(((in @ X3 @ X1)=>![X4:$i]:(((in @ X4 @ X5)=>(in @ (kpair @ X3 @ X4) @ (powerset @ (powerset @ (binunion @ X1 @ X5))))))))), file('/export/starexec/sandbox2/tmp/tmp.3ucgMh4tEK/E---3.1_20617.p', ubforcartprodlem3)).
0.17/0.46	thf(cartprod, axiom, ((cartprod)=(^[X1:$i, X5:$i]:(dsetconstr @ (powerset @ (powerset @ (binunion @ X1 @ X5))) @ (^[X3:$i]:(?[X4:$i]:(((in @ X4 @ X1)&?[X6:$i]:(((in @ X6 @ X5)&((X3)=(kpair @ X4 @ X6))))))))))), file('/export/starexec/sandbox2/tmp/tmp.3ucgMh4tEK/E---3.1_20617.p', cartprod)).
0.17/0.46	thf(c_0_4, plain, ((dsetconstrI)<=>![X1:$i, X2:$i > $o, X3:$i]:(((in @ X3 @ X1)=>((X2 @ X3)=>(in @ X3 @ (dsetconstr @ X1 @ (^[Z0/* 3 */:$i]:((X2 @ Z0))))))))), inference(fof_simplification,[status(thm)],[dsetconstrI])).
0.17/0.46	thf(c_0_5, negated_conjecture, ~((![X18:$i, X19:$i > $o, X20:$i]:(((in @ X20 @ X18)=>((X19 @ X20)=>(in @ X20 @ (dsetconstr @ X18 @ X19)))))=>(![X21:$i, X22:$i, X23:$i]:(((in @ X23 @ X21)=>![X24:$i]:(((in @ X24 @ X22)=>(in @ (kpair @ X23 @ X24) @ (powerset @ (powerset @ (binunion @ X21 @ X22))))))))=>![X1:$i, X5:$i, X3:$i]:(((in @ X3 @ X1)=>![X4:$i]:(((in @ X4 @ X5)=>(in @ (kpair @ X3 @ X4) @ (cartprod @ X1 @ X5))))))))), inference(fool_unroll,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[cartprodpairin]), c_0_4]), ubforcartprodlem3])])).
0.17/0.46	thf(c_0_6, plain, ((cartprod)=(^[Z0/* 19 */:$i, Z1:$i]:(dsetconstr @ (powerset @ (powerset @ (binunion @ Z0 @ Z1))) @ (^[Z2/* 5 */:$i]:(?[X4:$i]:(((in @ X4 @ Z0)&?[X6:$i]:(((in @ X6 @ Z1)&((Z2)=(kpair @ X4 @ X6))))))))))), inference(fof_simplification,[status(thm)],[cartprod])).
0.17/0.46	thf(c_0_7, negated_conjecture, ![X25:$i, X26:$i > $o, X27:$i, X28:$i, X29:$i, X30:$i, X31:$i]:(((~(in @ X27 @ X25)|(~(X26 @ X27)|(in @ X27 @ (dsetconstr @ X25 @ X26))))&((~(in @ X30 @ X28)|(~(in @ X31 @ X29)|(in @ (kpair @ X30 @ X31) @ (powerset @ (powerset @ (binunion @ X28 @ X29))))))&((in @ esk3_0 @ esk1_0)&((in @ esk4_0 @ esk2_0)&~(in @ (kpair @ esk3_0 @ esk4_0) @ (cartprod @ esk1_0 @ esk2_0))))))), inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])])).
0.17/0.46	thf(c_0_8, plain, ((cartprod)=(^[Z0/* 19 */:$i, Z1:$i]:(dsetconstr @ (powerset @ (powerset @ (binunion @ Z0 @ Z1))) @ (^[Z2/* 5 */:$i]:(?[X49:$i]:(((in @ X49 @ Z0)&?[X50:$i]:(((in @ X50 @ Z1)&((Z2)=(kpair @ X49 @ X50))))))))))), inference(split_conjunct,[status(thm)],[c_0_6])).
0.17/0.46	thf(c_0_9, negated_conjecture, ![X3:$i, X2:$i > $o, X1:$i]:(((in @ X1 @ (dsetconstr @ X3 @ X2))|~((in @ X1 @ X3))|~((X2 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_7])).
0.17/0.46	thf(c_0_10, plain, ![X1:$i, X3:$i]:(((dsetconstr @ (powerset @ (powerset @ (binunion @ X1 @ X3))) @ (^[Z0/* 5 */:$i]:(?[X51:$i]:(((in @ X51 @ X1)&?[X52:$i]:(((in @ X52 @ X3)&((Z0)=(kpair @ X51 @ X52)))))))))=(cartprod @ X1 @ X3))), inference(arg_cong,[status(thm)],[c_0_8])).
0.17/0.46	thf(c_0_11, negated_conjecture, ![X1:$i, X3:$i, X4:$i]:(((in @ X1 @ (cartprod @ X3 @ X4))|~(?[X53:$i]:(((in @ X53 @ X3)&?[X54:$i]:(((in @ X54 @ X4)&((X1)=(kpair @ X53 @ X54)))))))|~((in @ X1 @ (powerset @ (powerset @ (binunion @ X3 @ X4))))))), inference(spm,[status(thm)],[c_0_9, c_0_10])).
0.17/0.46	thf(c_0_12, negated_conjecture, ![X1:$i, X3:$i, X4:$i, X5:$i]:(((in @ (kpair @ X1 @ X4) @ (powerset @ (powerset @ (binunion @ X3 @ X5))))|~((in @ X1 @ X3))|~((in @ X4 @ X5)))), inference(split_conjunct,[status(thm)],[c_0_7])).
0.17/0.46	thf(c_0_13, negated_conjecture, ~((in @ (kpair @ esk3_0 @ esk4_0) @ (cartprod @ esk1_0 @ esk2_0))), inference(split_conjunct,[status(thm)],[c_0_7])).
0.17/0.46	thf(c_0_14, negated_conjecture, ![X1:$i, X3:$i, X4:$i, X5:$i]:(((in @ (kpair @ X1 @ X3) @ (cartprod @ X4 @ X5))|~((in @ X1 @ X4))|~((in @ X3 @ X5)))), inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_11])]), c_0_12])).
0.17/0.46	thf(c_0_15, negated_conjecture, (in @ esk3_0 @ esk1_0), inference(split_conjunct,[status(thm)],[c_0_7])).
0.17/0.46	thf(c_0_16, negated_conjecture, (in @ esk4_0 @ esk2_0), inference(split_conjunct,[status(thm)],[c_0_7])).
0.17/0.46	thf(c_0_17, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13, c_0_14]), c_0_15]), c_0_16])]), ['proof']).
0.17/0.46	# SZS output end CNFRefutation
0.17/0.46	# Parsed axioms                        : 15
0.17/0.46	# Removed by relevancy pruning/SinE    : 0
0.17/0.46	# Initial clauses                      : 17
0.17/0.46	# Removed in clause preprocessing      : 10
0.17/0.46	# Initial clauses in saturation        : 7
0.17/0.46	# Processed clauses                    : 21
0.17/0.46	# ...of these trivial                  : 0
0.17/0.46	# ...subsumed                          : 0
0.17/0.46	# ...remaining for further processing  : 21
0.17/0.46	# Other redundant clauses eliminated   : 1
0.17/0.46	# Clauses deleted for lack of memory   : 0
0.17/0.46	# Backward-subsumed                    : 0
0.17/0.46	# Backward-rewritten                   : 0
0.17/0.46	# Generated clauses                    : 12
0.17/0.46	# ...of the previous two non-redundant : 7
0.17/0.46	# ...aggressively subsumed             : 0
0.17/0.46	# Contextual simplify-reflections      : 1
0.17/0.46	# Paramodulations                      : 4
0.17/0.46	# Factorizations                       : 0
0.17/0.46	# NegExts                              : 0
0.17/0.46	# Equation resolutions                 : 1
0.17/0.46	# Disequality decompositions           : 0
0.17/0.46	# Total rewrite steps                  : 6
0.17/0.46	# ...of those cached                   : 0
0.17/0.46	# Propositional unsat checks           : 0
0.17/0.46	#    Propositional check models        : 0
0.17/0.46	#    Propositional check unsatisfiable : 0
0.17/0.46	#    Propositional clauses             : 0
0.17/0.46	#    Propositional clauses after purity: 0
0.17/0.46	#    Propositional unsat core size     : 0
0.17/0.46	#    Propositional preprocessing time  : 0.000
0.17/0.46	#    Propositional encoding time       : 0.000
0.17/0.46	#    Propositional solver time         : 0.000
0.17/0.46	#    Success case prop preproc time    : 0.000
0.17/0.46	#    Success case prop encoding time   : 0.000
0.17/0.46	#    Success case prop solver time     : 0.000
0.17/0.46	# Current number of processed clauses  : 13
0.17/0.46	#    Positive orientable unit clauses  : 9
0.17/0.46	#    Positive unorientable unit clauses: 0
0.17/0.46	#    Negative unit clauses             : 1
0.17/0.46	#    Non-unit-clauses                  : 3
0.17/0.46	# Current number of unprocessed clauses: 0
0.17/0.46	# ...number of literals in the above   : 0
0.17/0.46	# Current number of archived formulas  : 0
0.17/0.46	# Current number of archived clauses   : 8
0.17/0.46	# Clause-clause subsumption calls (NU) : 6
0.17/0.46	# Rec. Clause-clause subsumption calls : 5
0.17/0.46	# Non-unit clause-clause subsumptions  : 1
0.17/0.46	# Unit Clause-clause subsumption calls : 1
0.17/0.46	# Rewrite failures with RHS unbound    : 0
0.17/0.46	# BW rewrite match attempts            : 2
0.17/0.46	# BW rewrite match successes           : 0
0.17/0.46	# Condensation attempts                : 21
0.17/0.46	# Condensation successes               : 0
0.17/0.46	# Termbank termtop insertions          : 1688
0.17/0.46	# Search garbage collected termcells   : 299
0.17/0.46	
0.17/0.46	# -------------------------------------------------
0.17/0.46	# User time                : 0.003 s
0.17/0.46	# System time              : 0.003 s
0.17/0.46	# Total time               : 0.006 s
0.17/0.46	# Maximum resident set size: 1892 pages
0.17/0.46	
0.17/0.46	# -------------------------------------------------
0.17/0.46	# User time                : 0.004 s
0.17/0.46	# System time              : 0.005 s
0.17/0.46	# Total time               : 0.009 s
0.17/0.46	# Maximum resident set size: 1708 pages
0.17/0.46	% E---3.1 exiting
0.17/0.46	% E exiting
0.17/0.46	EOF